optimization of high-performance concrete structures by variable neighborhood search
نویسندگان
چکیده
this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighborhood search (bvns). the problem includes 14 variables: two geometrical one material type one mix design and 10 variables for the reinforcement setups. the algorithms are applied to two objective functions: the economic cost and the embedded co2 emissions. firstly, this paper presents the application of these three different optimization strategies, which are evaluated by fitting the set of solutions obtained to a three-parameter weibull distribution function. the variable neighborhood descent with threshold accepting acceptance strategy algorithm (vnd-ta) results as the most reliable method. finally, the study presents a parametric study of the span length from 10 to 20 m in which it can be concluded that economic and ecological beams show a good parabolic correlation with the span length.
منابع مشابه
SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...
متن کاملVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.
متن کاملVariable neighborhood search
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, wa...
متن کاملVariable Neighborhood Decomposition Search
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on...
متن کاملArbitrary-norm Separation by Variable Neighborhood Search
We consider the problem of separating two sets of points in an Euclidean space with a hyperplane that minimizes the sum of p-norm distances to the plane of points lying on the “wrong” side of the plane. A Variable Neighborhood Search metaheuristic framework is used to determine the plane coefficients. For a set of examples with L1-norm, L2-norm and L∞-norm, for which the exact solution can be c...
متن کاملGeneral variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of civil engineeringجلد ۱۱، شماره ۲، صفحات ۹۰-۹۹
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023